A New Algorithm for Independent Component Analysis With or Without Constraints

نویسندگان

  • Xuejun Liao
  • Lawrence Carin
چکیده

A new algorithm is developed for independent component analysis (ICA) with or without constraints on the mixing matrix. The algorithm is based on the criterion of Joint Approximate Diagonalization of Eigen-matrices (JADE). We propose a column-wise processing approach to perform joint diagonalization of the cumulant (eigen-) matrices. Instead of successively selecting paired columns of the unitary diagonalizing matrix U to which to apply planar Givens rotations (as in the original JADE algorithm), we sequentially process the columns of U and maximize the JADE criterion with respect to each individual column separately. We utilize the unitary property of U and achieve decoupling of its columns via orthogonal projections. We propose a method called Alternating Eigen-search (AE) to maximize the JADE criterion one column at a time. The method is extended to the case in which there are application-dependent quadratic constraints imposed on the mixing matrix, resulting in the so-called constrained ICA. Example results are provided to demonstrate the effectiveness and applicability of the algorithm.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Feature selection using genetic algorithm for classification of schizophrenia using fMRI data

In this paper we propose a new method for classification of subjects into schizophrenia and control groups using functional magnetic resonance imaging (fMRI) data. In the preprocessing step, the number of fMRI time points is reduced using principal component analysis (PCA). Then, independent component analysis (ICA) is used for further data analysis. It estimates independent components (ICs) of...

متن کامل

جداسازی طیفی و مکانی تصاویر ابرطیفی با استفاده از Semi-NMF و تبدیل PCA

Unmixing of remote-sensing data using nonnegative matrix factorization has been considered recently. To improve performance, additional constraints are added to the cost function. The main challenge is to introduce constraints that lead to better results for unmixing. Correlation between bands of Hyperspectral images is the problem that is paid less attention to it in the unmixing algorithms. I...

متن کامل

Optimization of grid independent diesel-based hybrid system for power generation using improved particle swarm optimization algorithm

The power supply of remote sites and applications at minimal cost and with low emissions is an important issue when discussing future energy concepts. This paper presents modeling and optimization of a photovoltaic (PV)/wind/diesel system with batteries storage for electrification to an off-grid remote area located in Rafsanjan, Iran. For this location, different hybrid systems are studied and ...

متن کامل

Development of Model and Algorithm for Depot Balancing Multi-Depot Vehicle Scheduling Problem Considering Depot Balancing

The main of multi-depot vehicle scheduling problem (MDVSP) is to schedule the timetabled trips using limited resources, optimally. The problem is very important in the management of the transportation systems. One of the most useful ways to better manage these systems is to consider the real conditions including depot balancing constraints. To normalize the number of vehicles departed from each...

متن کامل

Autonomous Underwater Vehicle Hull Geometry Optimization Using a Multi-objective Algorithm Approach

Abstarct In this paper, a new approach to optimize an Autonomous Underwater Vehicle (AUV) hull geometry is presented. Using this methode, the nose and tail of an underwater vehicle are designed, such that their length constraints due to the arrangement of different components in the AUV body are properly addressed. In the current study, an optimal design for the body profile of a torpedo-shaped...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002